Cuckoo hosts in England
نویسندگان
چکیده
منابع مشابه
LETTERS TO NATURE Learning to recognize nestlings is maladaptive for cuckoo Cuculus canorus hosts
Department of Zoology, Faculty of Life Sciences, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel occurrence, and a payoff is listed at the end of each path. A rejection strategy is adaptive if !Js overall payoff is greater than that of an acceptance strategy. In either case (egg or nestling recognition), if an acceptor is parasitized by a common cuckoo (a probability of P), its reproduc...
متن کاملReed Warbler Hosts Fine-Tune their Defenses to Track Three Decades of Cuckoo Decline
Interactions between avian hosts and brood parasites can provide a model for how animals adapt to a changing world. Reed warbler (Acrocephalus scirpaceus) hosts employ costly defenses to combat parasitism by common cuckoos (Cuculus canorus). During the past three decades cuckoos have declined markedly across England, reducing parasitism at our study site (Wicken Fen) from 24% of reed warbler ne...
متن کاملGetting rid of the cuckoo Cuculus canorus egg: why do hosts delay rejection?
Egg discrimination is well documented in many hosts of avian brood parasites, but the proximate mechanisms of egg recognition and rejection decisions are poorly understood. Relevant in this respect is the observation that rejectors of parasite eggs often delay their response. This delay has implications for understanding mechanisms important for egg recognition and is the main focus of the pres...
متن کاملDo life - history variables of European cuckoo hosts explain their egg - rejection behavior ?
Recently, Brooker and Brooker suggested an equilibrium in the level of host defense and parasite counter-defense despite the passage of sufficient time for the evolution of host defenses through coevolution between brood parasites and their hosts. A long coevolutionary history of brood parasitism and nest predation has favored an adjustment of the host’s life-history pattern to the point where ...
متن کاملCuckoo Hashing
We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bird Study
سال: 1963
ISSN: 0006-3657,1944-6705
DOI: 10.1080/00063656309476050